Direct GBQ Algorithm for Solving Mixed Trigonometric Polynomial Systems

نویسندگان

  • Yan YU
  • Bo DONG
  • Bo YU
چکیده

In many fields of science and engineering, it is needed to find all solutions of mixed trigonometric polynomial systems. Commonly, mixed trigonometric polynomial systems are transformed into polynomial systems by variable substitution and adding some quadratic equations, and then solved by some numerical methods. However, transformation of a mixed trigonometric polynomial system into a polynomial system will increase the dimension of the system and hence induces extra computational work. In this paper, we consider to solve the mixed trigonometric polynomial systems by homotopy method directly. Homotopy with the start system constructed by GBQ-algorithm is presented and homotopy theorems are proved. Preliminary numerical results show that our constructed direct homotopy method is more efficient than the existent direct homotopy methods.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...

متن کامل

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

An infeasible interior-point algorithm for solving the$P_*$-matrix linear complementarity problem based on a kernelfunction with trigonometric barrier term is analyzed. Each (main)iteration of the algorithm consists of a feasibility step andseveral centrality steps, whose feasibility step is induced by atrigonometric kernel function. The complexity result coincides withthe best result for infea...

متن کامل

The natural algorithmic approach of mixed trigonometric-polynomial problems

The aim of this paper is to present a new algorithm for proving mixed trigonometric-polynomial inequalities of the form [Formula: see text] by reducing them to polynomial inequalities. Finally, we show the great applicability of this algorithm and, as an example, we use it to analyze some new rational (Padé) approximations of the function cos2x and to improve a class of inequalities by Yang. Th...

متن کامل

Universally Quantified Interval Constraint Solving An Application to Camera Control

Non-linear real constraint systems with universally/existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifier-free equivalent form by means of Cylindrical Algebraic/Trigonometric Decomposition (CAD/CTD). However, CAD and CTD restrict their input to be conjunctions and disjunc...

متن کامل

Greedy Algorithms with Regard to Multivariate Systems with Special Structure

Department of Mathematics, University of South Carolina, Columbia, SC 29208 Abstract. The question of finding an optimal dictionary for nonlinear m-term approximation is studied in the paper. We consider this problem in the periodic multivariate (d variables) case for classes of functions with mixed smoothness. We prove that the well known dictionary U which consists of trigonometric polynomial...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017